Intelligent Hoisting with Car-Like Mobile Robots
نویسندگان
چکیده
منابع مشابه
Car-like Robots and Moving Obstacles Car-like Robots and Moving Obstacles
| This paper addresses motion planning for a car-like robot moving in a changing planar workspace, i.e. with moving obstacles. First, this motion planning problem is formulated in the state-time space framework. The state-time space of a robot is its state space plus the time dimension. In this framework part of the constraints at hand are translated into static forbidden regions of state-time ...
متن کاملLearning for Intelligent Mobile Robots
Unlike intelligent industrial robots which often work in a structured factory setting, intelligent mobile robots must often operate in an unstructured environment cluttered with obstacles and with many possible action paths. However, such machines have many potential applications in medicine, defense, industry and even the home that make their study important. Sensors such as vision are needed....
متن کاملMotion Planning for Car-like Robots
Motion planning is one of the most challenging tasks in robotics. Dedicated algorithms are used in many different applications starting from CNC machines to human-like robots. An interesting research area within this field is motion planning for car-like robots. In the last few years, car-like robots became increasingly important, because precise positioning systems like GPS or GLONASS and mode...
متن کاملNonholonomic motion planning for car-like robots
We consider the robot motion planning problem in the presence of non-integrable kinematic constraints, known as non-holonomic constraints. Car-like non-holonomic mobile robots are used for solving this problem, and several implemented planners are discussed. We claim that the randomized methods are more capable of efficiently solving many challenging, high-dimensional problems. Results with ran...
متن کاملObstacle distance for car-like robots
This paper shows how to compute the nonholonomic distance between a point-wise car-like robot and polygonal obstacles. Geometric constructions to compute the shortest paths from a configuration (given orientation and position in the plane of the robot) to a position (i.e., a configuration with unspecified final orientation) are first presented. The geometric structure of the reachable set (set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Construction Engineering and Management
سال: 2020
ISSN: 0733-9364,1943-7862
DOI: 10.1061/(asce)co.1943-7862.0001931